#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

int n, m;
int a[N], sum[N];
void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  rep(i, 1, n) sum[i] = (sum[i - 1] + a[i]) % 3;
  rep(l, 1, n - 2) rep(r, l + 1, n - 1) {
    int x = sum[l];
    int y = (sum[r] - sum[l] + 3) % 3;
    int z = (sum[n] - sum[r] + 3) % 3;
    if (x + y + z == 3 || x == y && y == z) {
      cout << l << ' ' << r << endl;
      return;
    }
  }
  cout << 0 << ' ' << 0 << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}